Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2008, Vol. 31 ›› Issue (4): 53-57.doi: 10.13190/jbupt.200804.53.016

• Papers • Previous Articles     Next Articles

Efficient ID-Based (Restrictive) Partially Blind Signature

CUI Wei1,XIN Yang1,HU Cheng-yu2,YANG Yi-xian1,LI Zhong-xian1,3   

  1. 1. State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876,China; 2. College of Computer Science and Technology, Shandong University, Jinan 250061,China; 3. Beijing Research and Development Center, Tianjing National Cybernet Security Limited, Beijing 100088,China)
  • Received:2007-10-17 Revised:1900-01-01 Online:2008-08-30 Published:2008-08-30
  • Contact: CUI Wei

Abstract:

A new identity-based partially blind signature scheme was proposed. Assuming the intractability of the q-Strong Diffie-Hellman problem, the scheme was proved to be unforgeable in the random oracle model. Compared with other existing schemes, the new scheme performs more efficient in computation because it doesn’t need inefficient MapToPoint hash function and only needs one pairing computation. Based on the scheme mentioned above, a restrictive partially blind signature is proposed and proved to be efficient, correct, unforgeable, as well as restrictive and partially blind.

Key words: identity-based, q-strong Diffie-Hellman problem, partially blind signature, restrictive partially blind signature

CLC Number: